TSTP Solution File: AGT030^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : AGT030^1 : TPTP v8.1.2. Released v5.2.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n013.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:08:56 EDT 2024
% Result : Theorem 0.22s 0.59s
% Output : CNFRefutation 0.22s
% Verified :
% SZS Type : Refutation
% Derivation depth : 12
% Number of leaves : 33
% Syntax : Number of formulae : 73 ( 28 unt; 19 typ; 0 def)
% Number of atoms : 141 ( 21 equ; 0 cnn)
% Maximal formula atoms : 9 ( 2 avg)
% Number of connectives : 377 ( 62 ~; 48 |; 4 &; 263 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 12 ( 5 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 116 ( 116 >; 0 *; 0 +; 0 <<)
% Number of symbols : 20 ( 18 usr; 3 con; 0-3 aty)
% Number of variables : 125 ( 52 ^ 73 !; 0 ?; 125 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
mu: $tType ).
thf(decl_24,type,
mnot: ( $i > $o ) > $i > $o ).
thf(decl_25,type,
mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_27,type,
mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_31,type,
mforall_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_32,type,
mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
thf(decl_33,type,
mexists_ind: ( mu > $i > $o ) > $i > $o ).
thf(decl_37,type,
mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_38,type,
mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
thf(decl_49,type,
mvalid: ( $i > $o ) > $o ).
thf(decl_53,type,
r1: $i > $i > $o ).
thf(decl_56,type,
r4: $i > $i > $o ).
thf(decl_58,type,
john: mu ).
thf(decl_62,type,
good_in_maths: mu > $i > $o ).
thf(decl_63,type,
maths_teacher: mu > $i > $o ).
thf(decl_84,type,
esk17_2: $i > ( $i > $o ) > $i ).
thf(decl_85,type,
esk18_2: $i > ( $i > $o ) > $i ).
thf(decl_96,type,
esk29_2: $i > ( $i > $o ) > $i ).
thf(decl_134,type,
esk67_0: $i ).
thf(mimplies,axiom,
( mimplies
= ( ^ [X6: $i > $o,X7: $i > $o] : ( mor @ ( mnot @ X6 ) @ X7 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mimplies) ).
thf(mnot,axiom,
( mnot
= ( ^ [X6: $i > $o,X3: $i] :
~ ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mnot) ).
thf(mor,axiom,
( mor
= ( ^ [X6: $i > $o,X7: $i > $o,X3: $i] :
( ( X6 @ X3 )
| ( X7 @ X3 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mor) ).
thf(mforall_ind,axiom,
( mforall_ind
= ( ^ [X8: mu > $i > $o,X3: $i] :
! [X1: mu] : ( X8 @ X1 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mforall_ind) ).
thf(mbox,axiom,
( mbox
= ( ^ [X13: $i > $i > $o,X6: $i > $o,X3: $i] :
! [X14: $i] :
( ~ ( X13 @ X3 @ X14 )
| ( X6 @ X14 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mbox) ).
thf(mvalid,axiom,
( mvalid
= ( ^ [X6: $i > $o] :
! [X3: $i] : ( X6 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mvalid) ).
thf(mexists_ind,axiom,
( mexists_ind
= ( ^ [X11: mu > $i > $o] :
( mnot
@ ( mforall_ind
@ ^ [X1: mu] : ( mnot @ ( X11 @ X1 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mexists_ind) ).
thf(mdia,axiom,
( mdia
= ( ^ [X13: $i > $i > $o,X6: $i > $o] : ( mnot @ ( mbox @ X13 @ ( mnot @ X6 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mdia) ).
thf(mforall_prop,axiom,
( mforall_prop
= ( ^ [X9: ( $i > $o ) > $i > $o,X3: $i] :
! [X10: $i > $o] : ( X9 @ X10 @ X3 ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',mforall_prop) ).
thf(axiom_r1,axiom,
( mvalid
@ ( mforall_ind
@ ^ [X1: mu] : ( mimplies @ ( maths_teacher @ X1 ) @ ( mbox @ r4 @ ( good_in_maths @ X1 ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',axiom_r1) ).
thf(axiom_a6,axiom,
mvalid @ ( maths_teacher @ john ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',axiom_a6) ).
thf(axiom_I_for_r4_r1,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ r4 @ X6 ) @ ( mbox @ r1 @ X6 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',axiom_I_for_r4_r1) ).
thf(axiom_D_for_r1,axiom,
( mvalid
@ ( mforall_prop
@ ^ [X6: $i > $o] : ( mimplies @ ( mbox @ r1 @ X6 ) @ ( mnot @ ( mbox @ r1 @ ( mnot @ X6 ) ) ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',axiom_D_for_r1) ).
thf(conj,conjecture,
( mvalid
@ ( mexists_ind
@ ^ [X1: mu] : ( mdia @ r1 @ ( good_in_maths @ X1 ) ) ) ),
file('/export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p',conj) ).
thf(c_0_14,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mimplies]) ).
thf(c_0_15,plain,
( mnot
= ( ^ [Z0: $i > $o,Z1: $i] :
~ ( Z0 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mnot]) ).
thf(c_0_16,plain,
( mor
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(fof_simplification,[status(thm)],[mor]) ).
thf(c_0_17,plain,
( mimplies
= ( ^ [Z0: $i > $o,Z1: $i > $o,Z2: $i] :
( ~ ( Z0 @ Z2 )
| ( Z1 @ Z2 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_14,c_0_15]),c_0_16]) ).
thf(c_0_18,plain,
( mforall_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
! [X1: mu] : ( Z0 @ X1 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_ind]) ).
thf(c_0_19,plain,
( mbox
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
! [X14: $i] :
( ~ ( Z0 @ Z2 @ X14 )
| ( Z1 @ X14 ) ) ) ),
inference(fof_simplification,[status(thm)],[mbox]) ).
thf(c_0_20,plain,
( mvalid
= ( ^ [Z0: $i > $o] :
! [X3: $i] : ( Z0 @ X3 ) ) ),
inference(fof_simplification,[status(thm)],[mvalid]) ).
thf(c_0_21,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mexists_ind]) ).
thf(c_0_22,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X20: $i] :
( ~ ( Z0 @ Z2 @ X20 )
| ~ ( Z1 @ X20 ) ) ) ),
inference(fof_simplification,[status(thm)],[mdia]) ).
thf(c_0_23,plain,
( mforall_prop
= ( ^ [Z0: ( $i > $o ) > $i > $o,Z1: $i] :
! [X10: $i > $o] : ( Z0 @ X10 @ Z1 ) ) ),
inference(fof_simplification,[status(thm)],[mforall_prop]) ).
thf(c_0_24,plain,
! [X23: $i,X22: mu] :
( ~ ( maths_teacher @ X22 @ X23 )
| ! [X21: $i] :
( ~ ( r4 @ X23 @ X21 )
| ( good_in_maths @ X22 @ X21 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_r1]),c_0_17]),c_0_18]),c_0_19]),c_0_20])]) ).
thf(c_0_25,plain,
! [X93: $i] : ( maths_teacher @ john @ X93 ),
inference(apply_def,[status(thm)],[axiom_a6,c_0_20]) ).
thf(c_0_26,plain,
( mexists_ind
= ( ^ [Z0: mu > $i > $o,Z1: $i] :
~ ! [X18: mu] :
~ ( Z0 @ X18 @ Z1 ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_21,c_0_15]),c_0_18]) ).
thf(c_0_27,plain,
( mdia
= ( ^ [Z0: $i > $i > $o,Z1: $i > $o,Z2: $i] :
~ ! [X20: $i] :
( ~ ( Z0 @ Z2 @ X20 )
| ~ ( Z1 @ X20 ) ) ) ),
inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[c_0_22,c_0_15]),c_0_19]) ).
thf(c_0_28,plain,
! [X131: $i,X130: $i > $o] :
( ~ ! [X128: $i] :
( ~ ( r4 @ X131 @ X128 )
| ( X130 @ X128 ) )
| ! [X129: $i] :
( ~ ( r1 @ X131 @ X129 )
| ( X130 @ X129 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_I_for_r4_r1]),c_0_17]),c_0_23]),c_0_19]),c_0_20])]) ).
thf(c_0_29,plain,
! [X313: $i,X314: mu,X315: $i] :
( ~ ( maths_teacher @ X314 @ X313 )
| ~ ( r4 @ X313 @ X315 )
| ( good_in_maths @ X314 @ X315 ) ),
inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[c_0_24])])]) ).
thf(c_0_30,plain,
! [X385: $i] : ( maths_teacher @ john @ X385 ),
inference(variable_rename,[status(thm)],[c_0_25]) ).
thf(c_0_31,plain,
! [X103: $i,X102: $i > $o] :
( ~ ! [X100: $i] :
( ~ ( r1 @ X103 @ X100 )
| ( X102 @ X100 ) )
| ~ ! [X101: $i] :
( ~ ( r1 @ X103 @ X101 )
| ~ ( X102 @ X101 ) ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[axiom_D_for_r1]),c_0_15]),c_0_17]),c_0_23]),c_0_19]),c_0_20])]) ).
thf(c_0_32,negated_conjecture,
~ ! [X312: $i] :
~ ! [X311: mu] :
~ ~ ! [X310: $i] :
( ~ ( r1 @ X312 @ X310 )
| ~ ( good_in_maths @ X311 @ X310 ) ),
inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj])]),c_0_26]),c_0_27]),c_0_20])]) ).
thf(c_0_33,plain,
! [X420: $i,X421: $i > $o,X423: $i] :
( ( ( r4 @ X420 @ ( esk29_2 @ X420 @ X421 ) )
| ~ ( r1 @ X420 @ X423 )
| ( X421 @ X423 ) )
& ( ~ ( X421 @ ( esk29_2 @ X420 @ X421 ) )
| ~ ( r1 @ X420 @ X423 )
| ( X421 @ X423 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_28])])])])])]) ).
thf(c_0_34,plain,
! [X3: $i,X1: mu,X14: $i] :
( ( good_in_maths @ X1 @ X14 )
| ~ ( maths_teacher @ X1 @ X3 )
| ~ ( r4 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_29]) ).
thf(c_0_35,plain,
! [X3: $i] : ( maths_teacher @ john @ X3 ),
inference(split_conjunct,[status(thm)],[c_0_30]) ).
thf(c_0_36,plain,
! [X392: $i,X393: $i > $o] :
( ( ( r1 @ X392 @ ( esk18_2 @ X392 @ X393 ) )
| ( r1 @ X392 @ ( esk17_2 @ X392 @ X393 ) ) )
& ( ( X393 @ ( esk18_2 @ X392 @ X393 ) )
| ( r1 @ X392 @ ( esk17_2 @ X392 @ X393 ) ) )
& ( ( r1 @ X392 @ ( esk18_2 @ X392 @ X393 ) )
| ~ ( X393 @ ( esk17_2 @ X392 @ X393 ) ) )
& ( ( X393 @ ( esk18_2 @ X392 @ X393 ) )
| ~ ( X393 @ ( esk17_2 @ X392 @ X393 ) ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])]) ).
thf(c_0_37,negated_conjecture,
! [X603: mu,X604: $i] :
( ~ ( r1 @ esk67_0 @ X604 )
| ~ ( good_in_maths @ X603 @ X604 ) ),
inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])]) ).
thf(c_0_38,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( X4 @ X14 )
| ~ ( X4 @ ( esk29_2 @ X3 @ X4 ) )
| ~ ( r1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_39,plain,
! [X14: $i,X3: $i] :
( ( good_in_maths @ john @ X3 )
| ~ ( r4 @ X14 @ X3 ) ),
inference(spm,[status(thm)],[c_0_34,c_0_35]) ).
thf(c_0_40,plain,
! [X3: $i,X4: $i > $o] :
( ( X4 @ ( esk18_2 @ X3 @ X4 ) )
| ~ ( X4 @ ( esk17_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_41,plain,
! [X3: $i,X4: $i > $o] :
( ( r1 @ X3 @ ( esk18_2 @ X3 @ X4 ) )
| ( r1 @ X3 @ ( esk17_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_42,negated_conjecture,
! [X1: mu,X3: $i] :
( ~ ( r1 @ esk67_0 @ X3 )
| ~ ( good_in_maths @ X1 @ X3 ) ),
inference(split_conjunct,[status(thm)],[c_0_37]) ).
thf(c_0_43,plain,
! [X14: $i,X15: $i,X3: $i] :
( ( good_in_maths @ john @ X3 )
| ~ ( r4 @ X14 @ ( esk29_2 @ X15 @ ( good_in_maths @ john ) ) )
| ~ ( r1 @ X15 @ X3 ) ),
inference(spm,[status(thm)],[c_0_38,c_0_39]) ).
thf(c_0_44,plain,
! [X4: $i > $o,X3: $i,X14: $i] :
( ( r4 @ X3 @ ( esk29_2 @ X3 @ X4 ) )
| ( X4 @ X14 )
| ~ ( r1 @ X3 @ X14 ) ),
inference(split_conjunct,[status(thm)],[c_0_33]) ).
thf(c_0_45,plain,
! [X3: $i] : ( r1 @ X3 @ ( esk18_2 @ X3 @ ( r1 @ X3 ) ) ),
inference(spm,[status(thm)],[c_0_40,c_0_41]) ).
thf(c_0_46,negated_conjecture,
! [X14: $i,X3: $i,X15: $i] :
( ~ ( r4 @ X3 @ ( esk29_2 @ X14 @ ( good_in_maths @ john ) ) )
| ~ ( r1 @ esk67_0 @ X15 )
| ~ ( r1 @ X14 @ X15 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_43]) ).
thf(c_0_47,plain,
! [X3: $i,X4: $i > $o] :
( ( X4 @ ( esk18_2 @ X3 @ ( r1 @ X3 ) ) )
| ( r4 @ X3 @ ( esk29_2 @ X3 @ X4 ) ) ),
inference(spm,[status(thm)],[c_0_44,c_0_45]) ).
thf(c_0_48,negated_conjecture,
! [X3: $i,X14: $i] :
( ( good_in_maths @ john @ ( esk18_2 @ X3 @ ( r1 @ X3 ) ) )
| ~ ( r1 @ esk67_0 @ X14 )
| ~ ( r1 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_46,c_0_47]) ).
thf(c_0_49,negated_conjecture,
! [X3: $i,X14: $i] :
( ~ ( r1 @ esk67_0 @ ( esk18_2 @ X3 @ ( r1 @ X3 ) ) )
| ~ ( r1 @ esk67_0 @ X14 )
| ~ ( r1 @ X3 @ X14 ) ),
inference(spm,[status(thm)],[c_0_42,c_0_48]) ).
thf(c_0_50,plain,
! [X3: $i,X4: $i > $o] :
( ( r1 @ X3 @ ( esk18_2 @ X3 @ X4 ) )
| ~ ( X4 @ ( esk17_2 @ X3 @ X4 ) ) ),
inference(split_conjunct,[status(thm)],[c_0_36]) ).
thf(c_0_51,negated_conjecture,
! [X3: $i] :
~ ( r1 @ esk67_0 @ X3 ),
inference(spm,[status(thm)],[c_0_49,c_0_45]) ).
thf(c_0_52,plain,
! [X3: $i] : ( r1 @ X3 @ ( esk18_2 @ X3 @ ( maths_teacher @ john ) ) ),
inference(spm,[status(thm)],[c_0_50,c_0_35]) ).
thf(c_0_53,negated_conjecture,
$false,
inference(spm,[status(thm)],[c_0_51,c_0_52]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.14 % Problem : AGT030^1 : TPTP v8.1.2. Released v5.2.0.
% 0.07/0.15 % Command : run_E %s %d THM
% 0.15/0.36 % Computer : n013.cluster.edu
% 0.15/0.36 % Model : x86_64 x86_64
% 0.15/0.36 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.36 % Memory : 8042.1875MB
% 0.15/0.36 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.36 % CPULimit : 300
% 0.15/0.36 % WCLimit : 300
% 0.15/0.36 % DateTime : Fri May 3 12:47:49 EDT 2024
% 0.15/0.37 % CPUTime :
% 0.22/0.51 Running higher-order theorem proving
% 0.22/0.51 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/tmp/tmp.MgAuSlvSUE/E---3.1_26116.p
% 0.22/0.59 # Version: 3.1.0-ho
% 0.22/0.59 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting almost_fo_3 with 1500s (5) cores
% 0.22/0.59 # Starting sh10 with 300s (1) cores
% 0.22/0.59 # Starting new_ho_16 with 300s (1) cores
% 0.22/0.59 # Starting post_as_ho11 with 300s (1) cores
% 0.22/0.59 # new_ho_16 with pid 26229 completed with status 8
% 0.22/0.59 # almost_fo_3 with pid 26227 completed with status 0
% 0.22/0.59 # Result found by almost_fo_3
% 0.22/0.59 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting almost_fo_3 with 1500s (5) cores
% 0.22/0.59 # No SInE strategy applied
% 0.22/0.59 # Search class: HGHNF-FSLF32-SHSSMMBN
% 0.22/0.59 # partial match(2): HGUNS-FSLF32-SHSSMMBN
% 0.22/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.59 # Starting new_ho_10 with 811s (1) cores
% 0.22/0.59 # Starting almost_fo_3 with 151s (1) cores
% 0.22/0.59 # Starting ho_unfolding_6 with 136s (1) cores
% 0.22/0.59 # Starting sh4l with 136s (1) cores
% 0.22/0.59 # Starting ehoh_best_nonlift_rwall with 136s (1) cores
% 0.22/0.59 # almost_fo_3 with pid 26248 completed with status 0
% 0.22/0.59 # Result found by almost_fo_3
% 0.22/0.59 # Preprocessing class: HSLSSMSSMLLNHSN.
% 0.22/0.59 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.22/0.59 # Starting almost_fo_3 with 1500s (5) cores
% 0.22/0.59 # No SInE strategy applied
% 0.22/0.59 # Search class: HGHNF-FSLF32-SHSSMMBN
% 0.22/0.59 # partial match(2): HGUNS-FSLF32-SHSSMMBN
% 0.22/0.59 # Scheduled 6 strats onto 5 cores with 1500 seconds (1500 total)
% 0.22/0.59 # Starting new_ho_10 with 811s (1) cores
% 0.22/0.59 # Starting almost_fo_3 with 151s (1) cores
% 0.22/0.59 # Preprocessing time : 0.004 s
% 0.22/0.59 # Presaturation interreduction done
% 0.22/0.59
% 0.22/0.59 # Proof found!
% 0.22/0.59 # SZS status Theorem
% 0.22/0.59 # SZS output start CNFRefutation
% See solution above
% 0.22/0.59 # Parsed axioms : 145
% 0.22/0.59 # Removed by relevancy pruning/SinE : 0
% 0.22/0.59 # Initial clauses : 185
% 0.22/0.59 # Removed in clause preprocessing : 47
% 0.22/0.59 # Initial clauses in saturation : 138
% 0.22/0.59 # Processed clauses : 256
% 0.22/0.59 # ...of these trivial : 0
% 0.22/0.59 # ...subsumed : 1
% 0.22/0.59 # ...remaining for further processing : 255
% 0.22/0.59 # Other redundant clauses eliminated : 0
% 0.22/0.59 # Clauses deleted for lack of memory : 0
% 0.22/0.59 # Backward-subsumed : 26
% 0.22/0.59 # Backward-rewritten : 0
% 0.22/0.59 # Generated clauses : 659
% 0.22/0.59 # ...of the previous two non-redundant : 617
% 0.22/0.59 # ...aggressively subsumed : 0
% 0.22/0.59 # Contextual simplify-reflections : 0
% 0.22/0.59 # Paramodulations : 659
% 0.22/0.59 # Factorizations : 0
% 0.22/0.59 # NegExts : 0
% 0.22/0.59 # Equation resolutions : 0
% 0.22/0.59 # Disequality decompositions : 0
% 0.22/0.59 # Total rewrite steps : 38
% 0.22/0.59 # ...of those cached : 31
% 0.22/0.59 # Propositional unsat checks : 0
% 0.22/0.59 # Propositional check models : 0
% 0.22/0.59 # Propositional check unsatisfiable : 0
% 0.22/0.59 # Propositional clauses : 0
% 0.22/0.59 # Propositional clauses after purity: 0
% 0.22/0.59 # Propositional unsat core size : 0
% 0.22/0.59 # Propositional preprocessing time : 0.000
% 0.22/0.59 # Propositional encoding time : 0.000
% 0.22/0.59 # Propositional solver time : 0.000
% 0.22/0.59 # Success case prop preproc time : 0.000
% 0.22/0.59 # Success case prop encoding time : 0.000
% 0.22/0.59 # Success case prop solver time : 0.000
% 0.22/0.59 # Current number of processed clauses : 91
% 0.22/0.59 # Positive orientable unit clauses : 11
% 0.22/0.59 # Positive unorientable unit clauses: 0
% 0.22/0.59 # Negative unit clauses : 1
% 0.22/0.59 # Non-unit-clauses : 79
% 0.22/0.59 # Current number of unprocessed clauses: 633
% 0.22/0.59 # ...number of literals in the above : 2435
% 0.22/0.59 # Current number of archived formulas : 0
% 0.22/0.59 # Current number of archived clauses : 164
% 0.22/0.59 # Clause-clause subsumption calls (NU) : 3488
% 0.22/0.59 # Rec. Clause-clause subsumption calls : 2207
% 0.22/0.59 # Non-unit clause-clause subsumptions : 1
% 0.22/0.59 # Unit Clause-clause subsumption calls : 67
% 0.22/0.59 # Rewrite failures with RHS unbound : 0
% 0.22/0.59 # BW rewrite match attempts : 0
% 0.22/0.59 # BW rewrite match successes : 0
% 0.22/0.59 # Condensation attempts : 0
% 0.22/0.59 # Condensation successes : 0
% 0.22/0.59 # Termbank termtop insertions : 39432
% 0.22/0.59 # Search garbage collected termcells : 13655
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.049 s
% 0.22/0.59 # System time : 0.009 s
% 0.22/0.59 # Total time : 0.058 s
% 0.22/0.59 # Maximum resident set size: 4252 pages
% 0.22/0.59
% 0.22/0.59 # -------------------------------------------------
% 0.22/0.59 # User time : 0.196 s
% 0.22/0.59 # System time : 0.049 s
% 0.22/0.59 # Total time : 0.245 s
% 0.22/0.59 # Maximum resident set size: 1860 pages
% 0.22/0.59 % E---3.1 exiting
% 0.22/0.59 % E exiting
%------------------------------------------------------------------------------